Primitive Prime Divisors in Polynomial Arithmetic Dynamics
نویسنده
چکیده
The question of which terms of a recurrence sequence fail to have primitive prime divisors has been significantly studied for several classes of linear recurrence sequences and for elliptic divisibility sequences. In this paper, we consider the question for sequences generated by the iteration of a polynomial. For two classes of polynomials f(x) ∈ Z[x] and initial values a1 ∈ Z, we show that the sequence (an) given by an+1 = f(an) for n ≥ 1 has only finitely many terms which have no primitive prime divisor.
منابع مشابه
Primitive Prime Divisors in Zero Orbits of Polynomials
Let (bn) = (b1, b2, . . . ) be a sequence of integers. A primitive prime divisor of a term bk is a prime which divides bk but does not divide any of the previous terms of the sequence. A zero orbit of a polynomial φ(z) is a sequence of integers (cn) where the n-th term is the n-th iterate of φ at 0. We consider primitive prime divisors of zero orbits of polynomials. In this note, we show that f...
متن کاملPrimitive Prime Divisors of First-Order Polynomial Recurrence Sequences
The question of which terms of a recurrence sequence fail to have primitive prime divisors has been significantly studied for several classes of linear recurrence sequences and for elliptic divisibility sequences. In this paper, we consider the question for sequences generated by the iteration of a polynomial. For two classes of polynomials f(x) ∈ Z[x] and initial values a1 ∈ Z, we show that th...
متن کاملThe Density of Prime Divisors in the Arithmetic Dynamics of Quadratic Polynomials
Let f ∈ Z[x], and consider the recurrence given by an = f(an−1), with a0 ∈ Z. Denote by P (f, a0) the set of prime divisors of this recurrence, i.e., the set of primes p dividing some non-zero an, and denote the natural density of this set by D(P (f, a0)). The problem of determining D(P (f, a0)) when f is linear has attracted significant study, although it remains unresolved in full generality....
متن کاملPrimitive Divisors in Arithmetic Dynamics
Let φ(z) ∈ Q(z) be a rational function of degree d ≥ 2 with φ(0) = 0 and such that φ does not vanish to order d at 0. Let α ∈ Q have infinite orbit under iteration of φ and write φ(α) = An/Bn as a fraction in lowest terms. We prove that for all but finitely many n ≥ 0, the numerator An has a primitive divisor, i.e., there is a prime p such that p | An and p ∤ Ai for all i < n. More generally, w...
متن کاملCourse 311: Michaelmas Term 2005 Part I: Topics in Number Theory
1 Topics in Number Theory 2 1.1 Subgroups of the Integers . . . . . . . . . . . . . . . . . . . . 2 1.2 Greatest Common Divisors . . . . . . . . . . . . . . . . . . . . 2 1.3 The Euclidean Algorithm . . . . . . . . . . . . . . . . . . . . . 3 1.4 Prime Numbers . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.5 The Fundamental Theorem of Arithmetic . . . . . . . . . . . . 5 1.6 The Infini...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007